Complexity ( for Algorithm Designers ) Lecture # 5 : Lower Bounds for the Extension
نویسنده
چکیده
You’ve probably seen some polynomial-time algorithms for the problem of computing a maximum-weight matching of a bipartite graph. Many of these, like the Kuhn-Tucker algorithm [9], are “combinatorial algorithms” that operate directly on the graph. Linear programming is also an effective tool for solving many discrete optimization problems. For example, consider the following linear programming relaxation of the maximumweight bipartite matching problem (for a weighted bipartite graph G = (U, V,E,w)):
منابع مشابه
Communication Complexity (for Algorithm Designers)
Preface The best algorithm designers prove both possibility and impossibility results — both upper and lower bounds. For example, every serious computer scientist knows a collection of canonical NP-complete problems and how to reduce them to other problems of interest. Communication complexity offers a clean theory that is extremely useful for proving lower bounds for lots of different fundamen...
متن کاملCS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 9 : Lower Bounds in Property Testing ∗
We first give a brief introduction to the field of property testing. Section 3 gives upper bounds for the canonical property of “monotonicity testing,” and Section 4 shows how to derive property testing lower bounds from communication complexity lower bounds. We won’t need to develop any new communication complexity; our existing toolbox (specifically, Disjointness) is already rich enough to de...
متن کاملCS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 8 : Lower Bounds in Property Testing ∗
We begin in this section with a brief introduction to the field of property testing. Section 2 explains the famous example of “linearity testing.” Section 3 gives upper bounds for the canonical problem of “monotonicity testing,” and Section 4 shows how to derive property testing lower bounds from communication complexity lower bounds. These lower bounds will follow from our existing communicati...
متن کاملComplexity ( for Algorithm Designers ) Lecture # 8 : Lower Bounds in Algorithmic Game Theory ∗
This lecture explains some applications of communication complexity to proving lower bounds in algorithmic game theory (AGT), at the border of computer science and economics. There are a number of situations in AGT where the natural description size of an object is exponential a parameter of interest, and one would like to non-trivial computation in time polynomial in the parameter (logarithmic...
متن کاملComplexity ( for Algorithm Designers ) Lecture # 7 : Lower Bounds in Algorithmic Game Theory ∗
This lecture explains some applications of communication complexity to proving lower bounds in algorithmic game theory (AGT), at the border of computer science and economics. In AGT, the natural description size of an object is often exponential in a parameter of interest, and the goal is to perform non-trivial computations in time polynomial in the parameter (i.e., logarithmic in the descripti...
متن کامل